Order-Hiding Range Query Over Encrypted Cloud Data

Range query on encrypted data has been widely studied to achieve fast processing while keeping and queries secret. Prior work hides even the ordering information of data, but sacrifices accuracy (e.g., false positives) efficiency exponential complexity in domain size) as a trade-off. Moreover, hiding order alone is not sufficient prevent recent database reconstruction attacks range abusing access pattern volume leakage. Several countermeasures such leakage incur practically unacceptable storage or computational overhead due fake records embedded re-encryption procedures. In this paper, we first propose scheme RevealRE, which highly efficient, reveals information. We then extend RevealRE construct HideRE, that does leak accurate (i.e., no positives/negatives) efficient logarithmic search time). HideRE can mitigate by introducing deceptive queries, are indistinguishable from regular obfuscating queried ranges. experimentally confirm our construction under various distribution models, demonstrating practicality. Resilience order-hiding formally proved.